Nested quantum annealing correction

Error correction for encoded quantum annealing

Recently, Lechner, Hauke and Zoller [1] have proposed a quantum annealing architecture, in which a classical spin glass with all-to-all pairwise connectivity is simulated by a spin glass with geometrically local interactions. We interpret this architecture as a classical error-correcting code, which is highly robust against weakly correlated bit-flip noise, and we analyze the code’s performance...

On Simulated Annealing and Nested Annealing

Simulated Annealing is a family of randomized algorithms used to solve many combinatorial optimization problems. In practice they have been applied to solve some presumably hard (e.g., NP-complete) problems. The level of performance obtained has been promising [5, 2, 6, 14]. The success of this heuristic technique has motivated analysis of this algorithm from a theoretical point of view. In par...

Nested annealing: a provable . . .

Error correction for a proposed quantum annealing architecture

Recently, Lechner, Hauke and Zoller [1] have proposed a quantum annealing architecture, in which a classical spin glass with all-to-all connectivity is simulated by a spin glass with geometrically local interactions. We interpret this architecture as a classical error-correcting code, which is highly robust against weakly correlated bit-flip noise. Quantum annealing [2] is a method for solving ...

Nested Annealing: A Provable Improvement to Simulated Annealing

Simulated Annealing is a family of randomized algorithms for solving multivariate global optimization problems. Empirical results from the application of Simulated Annealing algorithms to certain hard problems including certain types of NPcomplete problems demonstrate that these algorithms yield better results than known heuristic algorithms. But for the worst case input, the time bound can be ...